Preconditioned Jacobi-Davidson Algorithm for Nonsymmetric, Complex Eigenvalue Problems arising with Gyrotropic Materials in Resonator Cavities
نویسندگان
چکیده
For the numerical solution of complex eigenvalue problems, arising with gyrotropic materials in resonators, the Jacobi-Davidson method is considered. In this paper the correction equation, which has to be solved within the Jacobi-Davidson method, is simplified and several preconditioning strategies, including also a multigrid scheme, are compared for the approximate solution of this correction equation. Comparisons between this multigrid-solver and standard solvers regarding computation time are performed.
منابع مشابه
Rayleigh Quotient Iteration and Simplified Jacobi-davidson with Preconditioned Iterative Solves for Generalised Eigenvalue Problems
The computation of a right eigenvector and corresponding finite eigenvalue of a large sparse generalised eigenproblem Ax = λMx using preconditioned Rayleigh quotient iteration and the simplified JacobiDavidson method is considered. Both methods are inner-outer iterative methods and we consider GMRES and FOM as iterative algorithms for the (inexact) solution of the inner systems that arise. The ...
متن کاملA parallel additive Schwarz preconditioned Jacobi-Davidson algorithm for polynomial eigenvalue problems in quantum dot simulation
We develop a parallel Jacobi-Davidson approach for finding a partial set of eigenpairs of large sparse polynomial eigenvalue problems with application in quantum dot simulation. A Jacobi-Davidson eigenvalue solver is implemented based on the Portable, Extensible Toolkit for Scientific Computation (PETSc). The eigensolver thus inherits PETSc’s efficient and various parallel operations, linear so...
متن کاملRayleigh Quotient iteration and simplified Jacobi-Davidson method with preconditioned iterative solves
We show that for the non-Hermitian eigenvalue problem simplified Jacobi-Davidson with preconditioned Galerkin-Krylov solves is equivalent to inexact Rayleigh quotient iteration where the preconditioner is altered by a simple rank one change. This extends existing equivalence results to the case of preconditioned iterative solves. Numerical experiments are shown to agree with the theory.
متن کاملEfficient Methods For Nonlinear Eigenvalue Problems Diploma Thesis
During the last years nonlinear eigenvalue problems of the type T (λ)x = 0 became more and more important in many applications with the rapid development of computing performance. In parallel the minmax theory for symmetric nonlinear eigenvalue problems was developed which reveals a strong connection to corresponding linear problems. We want to review the current theory for symmetric nonlinear ...
متن کاملA Parallel Scalable PETSc-Based Jacobi-Davidson Polynomial Eigensolver with Application in Quantum Dot Simulation
The Jacobi-Davidson (JD) algorithm recently has gained popularity for finding a few selected interior eigenvalues of large sparse polynomial eigenvalue problems, which commonly appear in many computational science and engineering PDE based applications. As other inner–outer algorithms like Newton type method, the bottleneck of the JD algorithm is to solve approximately the inner correction equa...
متن کامل